Comparison of interestingness measures applied to textual taxonomies matching
نویسندگان
چکیده
This paper presents an experimental comparison of Interestingness Measures (IMs), in the context of an approach designed for matching textual taxonomies. This extensional and asymmetric approach makes use of association rule model for matching entities issued from two textual hierarchies. We select 6 IMs and we perform two experiments on a benchmark composed of two textual taxonomies and a set of reference matching relations between the concepts of the two structures. The first test concerns a comparison of matching accuracy with each of the selected measures. In the second experiment, we compare how each IM evaluates reference relations by studying their values distributions. Results show that the implication intensity delivers the best results.
منابع مشابه
On interestingness measures of formal concepts
Formal concepts and closed itemsets proved to be of big importance for knowledge discovery, both as a tool for concise representation of association rules and a tool for clustering and constructing domain taxonomies and ontologies. Exponential explosion makes it difficult to consider the whole concept lattice arising from data, one needs to select most useful and interesting concepts. In this p...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملOn the use of Implication Intensity for matching ontologies and textual taxonomies
data algorithm analysis artificial intelligence computer science database system image processing computer architecture computer programming A1
متن کاملEvaluating the Interestingness of Characteristic Rules
Knowledge Discovery Systems can be used to generate classification rules describing data from databases. Typically, only a small fraction of the rules generated may actually be of interest. Measures of rule intemstingness allow us to filter out less interesting rules. Classification rules may be discriminant (e + h) or characteristic (h + e), where e is evidence, and h is an hypothesis. For dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007